The Deny Proof of the Palindrome Number Conjecture

Palindrome number conjecture: Take any non-palindromic natural with two or more digits, add its inverse ordinal number, continue to use the inverted of sum plus sum, repeat this process continuously. After a finite operations, palindrome must be obtained. We firstly give out several definitions: The pure-single-digit-of-sum is single digits that only count numbers same digit in vertical operation addition, which referred as pure for short, denoted by g. pure-carry-digit-of-sum carry counts bit addition. It special composed 1 and 0, represented j'. complement-0-carry-digit-of-sum supplement 0 on last side j' according rule adding bits, j. Therefore, addition operation, divided into parts: g Then, characteristics j are characterized following theorems: Theorem 1: As all number; not number. 2: H non-palindrome Then we proved conjecture correct using above theorems.